Exact (Exponential) Algorithms for the Dominating Set Problem
نویسندگان
چکیده
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our time complexities are exponential in the number n of vertices. The contribution of this paper are ‘nice’ exponential time complexities that are bounded by functions of the form c with reasonably small constants c < 2: For arbitrary graphs we get a time complexity of 1.93782. And for the special cases of split graphs, bipartite graphs, and graphs of maximum degree three, we reach time complexities of 1.41422, 1.73206, and 1.64515, respectively.
منابع مشابه
NONBLOCKER: Parameterized Algorithmics for minimum dominating set
We provide parameterized algorithms for nonblocker, the parametric dual of the well known dominating set problem. We exemplify three methodologies for deriving parameterized algorithms that can be used in other circumstances as well, including the (i) use of extremal combinatorics (known results from graph theory) in order to obtain very small kernels, (ii) use of known exact algorithms for the...
متن کاملDesign by Measure and Conquer: Exact algorithms for dominating set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we propose to use measure and conquer also as a tool in the design of algorithms. In an iterative process, we obtain a series of branch and reduce algorithms. A mathematical analysis of an algorithm in the series with m...
متن کاملExact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
In this paper, we consider theMinimum Independent Dominating Set problem and develop exact exponential algorithms that break the trivial O(2|V |) bound. A simple O∗( √ 3 |V | ) time algorithm is developed to solve this problem on general graphs. For sparse graphs, e.g. graphs with degree bounded by 3 and 4, we show that a few new branching techniques can be applied to these graphs and the resul...
متن کاملA Moderately Exponential Time Algorithm for Full Degree Spanning Tree
We consider the well studied Full Degree Spanning Tree problem, a NP-complete variant of the Spanning Tree problem, in the realm of moderately exponential time exact algorithms. In this problem, given a graph G, the objective is to find a spanning tree T of G which maximizes the number of vertices that have the same degree in T as in G. This problem is motivated by its application in fluid netw...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کامل